Time-free Solution to Independent Set Problem using P Systems with Active Membranes

Solving NP-Complete Problems Using P Systems with Active Membranes

Polarizationless P Systems with Active Membranes

The subject of this paper is the continuation of the studies of P systems with active membranes without polarizations with the label-changing capacity of some rules. Rewriting and communication rules that do not change membrane labels can be applied either sequentially or in a maximally parallel way. We consider several classes of P systems and study their generative power. Particularly interes...

Constant-Space P Systems with Active Membranes

We continue the investigation of the computational power of spaceconstrained P systems. We show that only a constant amount of space is needed in order to simulate a polynomial-space bounded Turing machine. Due to this result, we propose an alternative definition of space complexity for P systems, where the amount of information contained in individual objects and membrane labels is also taken ...

P Systems with Active Membranes Characterize PSPACE

P system is a natural computing model inspired by behavior of living cells and their membranes. We show that (semi-)uniform families of P systems with active membranes can solve in polynomial time exactly the class of problems PSPACE. Consequently, these P systems are computationally equivalent (w.r.t. the polynomial time reduction) to standard parallel machine models as PRAM and the alternatin...

Flattening P Systems with Active Membranes

Given a P system Π with active membranes having several membranes, we construct a P system Π having only one membrane and rules involving catalysts, cooperation and priorities. The evolution of this “flat” P system Π simulates the evolution of initial P system with active membranes Π by replacing any rule that changes the configuration in Π by prioritized rules application in a configuration of...